Symbolic computation with finite biquandles
نویسندگان
چکیده
A method of computing a basis for the second Yang-Baxter cohomology of a finite biquandle with coefficients in Q and Zp from a matrix presentation of the finite biquandle is described. We also describe a method for computing the Yang-Baxter cocycle invariants of an oriented knot or link represented as a signed Gauss code. We provide a URL for our Maple implementations of these algorithms.
منابع مشابه
Classification of finite Alexander biquandles
We show that two finite Alexander biquandles M and M ′ are isomorphic iff there is an isomorphism of Z[s, t]-modules h : (1 − st)M → (1 − st)M ′ and a bijection g : Os(A) → Os(A ) between the s-orbits of sets of coset representatives of M/(1− st)M and M /(1− st)M ′ respectively satisfying certain compatibility conditions.
متن کاملSymbolic computation of the Duggal transform
Following the results of cite{Med}, regarding the Aluthge transform of polynomial matrices, the symbolic computation of the Duggal transform of a polynomial matrix $A$ is developed in this paper, using the polar decomposition and the singular value decomposition of $A$. Thereat, the polynomial singular value decomposition method is utilized, which is an iterative algorithm with numerical charac...
متن کامل1 Symbolic Computation and Parallel Software
Two aspects of parallelism as related to symbolic computing are presented: (1) the implementation of parallel programs for the factorization of polynomials, and (2) the automatic derivation and generation of parallel codes for finite element analysis. The former illustrates the use of parallel programming to speed up symbolic manipulation. The latter shows how symbolic systems can help create p...
متن کاملOn Axioms of Biquandles
We prove that the two conditions from the definition of a biquandle by Fenn, Jordan-Santana, Kauffman [1] are equivalent and thus answer a question posed in the paper. We also construct a weak biquandle, which is not a biquandle. According to Fenn, Jordan-Santana and Kauffman [1], biquandles provide powerful invariants of virtual knots and links. It is thus desirable to simplify their axioms as...
متن کاملOptimised finite difference computation from symbolic equations
Domain-specific high-productivity environments are playing an increasingly important role in scientific computing due to the levels of abstraction and automation they provide. In this paper we introduce Devito, an opensource domain-specific framework for solving partial differential equations from symbolic problem definitions by the finite difference method. We highlight the generation and auto...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Symb. Comput.
دوره 42 شماره
صفحات -
تاریخ انتشار 2007